Process Algebra with Recursive

نویسندگان

  • Jan Bergstra
  • Wan Fokkink
  • Alban Ponse
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A recursive construction of a class of finite normalized tight frames

Finite normalized tight frames are interesting because they provide decompositions in applications and some physical interpretations. In this article, we give a recursive method for constructing them.

متن کامل

Unguardedness mostly means many solutions

A widely accepted method to specify (possibly infinite) behaviour is to define it as the solution, in some process algebra, of a recursive specification, i.e., a system of recursive equations over the fundamental operations of the process algebra. The method only works if the recursive specification has a unique solution in the process algebra; it is well-known that guardedness is a sufficient ...

متن کامل

Equivalence of recursive specifications in process algebra

We define an equivalence relation on recursive specifications in process algebra that is model-independent and does not involve an explicit notion of solution. Then we extend this equivalence to the specification language μCRL.  2001 Elsevier Science B.V. All rights reserved.

متن کامل

Some Finite-Graph Models for Process Algebra

In this paper, we present a number of closely related models of process algebra [2, 3, 4], called finite-graph models. In a finite-graph model of process algebra, each process is a bisimulafion class of a particular kind of process graphs, called recursive process graphs. Just as in the standard graph model [I], each guarded recursive specification has exactly one solution in a finite-graph mod...

متن کامل

Normal Form in DI-Algebra with Recursion

DI-algebra is a process algebra for delay-insensitive processes. Like in most process algebras, a normal form for finite expressions can be defined. Unlike most process algebras, however, we show that we can also define a normal form for recursive expressions. This is done by first eliminating operators using the laws of the algebra and then minimizing cycles in a state graph.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007